Meta Structures in Knowledge Graphs
نویسندگان
چکیده
Abstract. This paper investigates meta structures, schema-level graphs that abstract connectivity information among a set of entities in a knowledge graph. Meta structures are useful in a variety of knowledge discovery tasks ranging from relatedness explanation to data retrieval. We formalize the meta structure computation problem and devise efficient automata-based algorithms. We introduce a meta structure-based relevance measure, which can retrieve entities related to those in input. We implemented our machineries in a visual tool called MEKoNG. We report on an extensive experimental evaluation, which confirms the suitability of our proposal from both the efficiency and effectiveness point of view.
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملUsing a Meta{Notation in a CORBA environment
In this position statement we demonstrate how a meta{notation can be employed in a CORBA environment. For the scope of this paper the term meta{notation refers to a notation which allows the representation of arbitrary syntactical structures 1. In an earlier project we have shown how to translate CORBA{ and DCE{IDL speciications to speciications written an such a meta{notation. Here we demonstr...
متن کاملLink Analysis of Social Meta-Networks∗
There has been a great deal of recent work within the knowledge systems community concerning the role that graph and network theory can play in the organization and retrieval of information. The basic idea is that knowledge systems, including document corpora, but most especially the World Wide Web, can be amply represented as a network or graph-theoretical structure. Then, mathematical and sta...
متن کاملOPTIMAL SIZE AND GEOMETRY DESIGN OF TRUSS STRUCTURES UTILIZING SEVEN META-HEURISTIC ALGORITHMS: A COMPARATIVE STUDY
Meta-heuristic algorithms are applied in optimization problems in a variety of fields, including engineering, economics, and computer science. In this paper, seven population-based meta-heuristic algorithms are employed for size and geometry optimization of truss structures. These algorithms consist of the Artificial Bee Colony algorithm, Cyclical Parthenogenesis Algorithm, Cuckoo Search algori...
متن کاملConceptual Graphs and First-Order Logic
Conceptual Structures (CS) Theory is a logic-based knowledge representation formalism. To show that conceptual graphs have the power of rst-order logic, it is necessary to have a mapping between both formalisms. A proof system, i.e. axioms and inference rules, for conceptual graphs is also useful. It must be sound (no false statement is derived from a true one) and complete (all possible tautol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017